Seleção De Isolados De Trichoderma Para O Controle Biológico De Sclerotinia Minor E S. Sclerotiorum Em Alface

Lettuce drop is one of the most important and difficult-to-control diseases affecting lettuce in Brazil and worldwide. This study was carried out to select Trichoderma isolates antagonistic to Sclerotinia minor and S. sclerotiorum, aiming to develop biological control for this pathosystem in Brazil. Thirty-one Trichoderma isolates were obtained with the use of baits and were tested under laboratory conditions for their ability to control S. minor and S. sclerotiorum in seedlings of lettuce cultivar Tainá cultured in Petri dishes containing water-agar medium. Subsequently, four isolates effective for control and showing high sporulation under laboratory conditions were evaluated in greenhouse in two experiments carried out with both pathogens in lettuce seedlings of the same cultivar. Twenty-two isolates showed ability to control S. minor and S. sclerotiorum in the in vitro experiments. The isolates tested under greenhouse conditions, identified as T. asperellum (IBLF 897, IBLF 904 and IBLF 914) and T. asperelloides (IBLF 908), reduced lettuce drop of seedlings caused by both pathogens but were more effective against S. minor. Biological control is a promising technology for the management of lettuce drop, especially because S. minor is the predominant species in infested lettuce fields in Brazil. © 2016, Universidade Estadual Paulista (UNESP). All rights reserved.42321622

Efeito Da Temperatura Sobre O Crescimento Micelial De Trichoderma, Sclerotinia Minor E S. Sclerotiorum E Sobre O Micoparasitismo

Environmental conditions are very important for the biological control of plant diseases. In a previous study, isolates of Trichoderma asperellum (IBLF 897, IBLF 904 and IBLF 914) and T. asperelloides (IBLF 908) were selected as antagonists of S. minor and S. sclerotiorum, causal agents of lettuce drop, one of the most relevant diseases affecting the lettuce crop. In this subsequent study, the mycelial growth of these isolates and pathogens, as well as the mycoparasitism of isolate IBLF 914, was evaluated at different temperatures. The mycelial growth of the isolates of T. asperellum and T. asperelloides, as well as of S. minor and S. sclerotiorum, was evaluated at temperatures ranging from 7 to 42°C. The parasitism of propagules of S. minor and S. sclerotiorum by the isolate IBLF 914, as well as the number of lettuce seedlings surviving drop, was evaluated at 12, 17, 22, 27 and 32°C, in gerboxes containing substrate. S. minor and S. sclerotiorum showed mycelial growth at temperatures ranging from 7 to 27°C, but no growth occurred at 32 °C, and both pathogens had greater mycelial growth at 22°C. The isolates of Trichoderma grew at temperatures ranging from 12 to 37°C, with maximum growth at 27°C. The isolate IBLF 914 had mycoparasitism and reduced the disease in lettuce seedlings at temperatures ranging from 22 to 32°C. Since lettuce drop occurs when mild temperatures and high humidity prevail and the antagonist was more effective at higher temperatures, it is recommended that Trichoderma is applied in lettuce fields in Brazil also during warmer months of the year to reduce the inoculum remaining in the soil before planting the winter crop, which is more affected by the disease. © 2016, Universidade Estadual Paulista (UNESP). All rights reserved.42322222

Integrated Reasoning and Proof Choice Point Selection in the Jahob System – Mechanisms for Program Survival

In recent years researchers have developed a wide range of powerful automated reasoning systems. We have leveraged these systems to build Jahob, a program specification, analysis, and verification system. In contrast to many such systems, which use a monolithic reasoning approach, Jahob provides a general integrated reasoning framework, which enables multiple automated reasoning systems to work together to prove the desired program correctness properties. We have used Jahob to prove the full functional correctness of a collection of linked data structure implementations. The automated reasoning systems are able to automatically perform the vast majority of the reasoning steps required for this verification. But there are some complex verification conditions that they fail to prove. We have therefore developed a proof language, integrated into the underlying imperative Java programming language, that developers can use to control key choice points in the proof search space. Once the developer has resolved these choice points, the automated reasoning systems are able to complete the verification. This approach appropriately leverages both the developer’s insight into the high-level structure of the proof and the ability of the automated reasoning systems to perform the mechanical steps required to prove the verification conditions. Building on Jahob’s success with this challenging program verification problem, we contemplate the possibility of verifying the complete absence of fatal errors in large software systems. We envision combining simple techniques that analyze the vast majority of the program with heavyweight techniques that analyze those more sophisticated parts of the program that may require arbitrarily sophisticated reasoning. Modularity mechanisms such as abstract data types enable the sound division of the program for this purpose. The goal is not a completely correct program, but a program that can survive any remaining errors to continue to provide acceptable service

Adapting Real Quantifier Elimination Methods for Conflict Set Computation

The satisfiability problem in real closed fields is decidable. In the context of satisfiability modulo theories, the problem restricted to conjunctive sets of literals, that is, sets of polynomial constraints, is of particular importance. One of the central problems is the computation of good explanations of the unsatisfiability of such sets, i.e.\ obtaining a small subset of the input constraints whose conjunction is already unsatisfiable. We adapt two commonly used real quantifier elimination methods, cylindrical algebraic decomposition and virtual substitution, to provide such conflict sets and demonstrate the performance of our method in practice

Checking bounded reachability in asynchronous systems by symbolic event tracing

This report presents a new symbolic technique for checking reachability properties of asynchronous systems by reducing the problem to satisfiability in restrained difference logic. The analysis is bounded by fixing a finite set of potential events, each of which may occur at most once in any order. The events are specified using high-level Petri nets. The logic encoding describes the space of possible causal links between events rather than possible sequences of states as in Bounded Model Checking. Independence between events is exploited intrinsically without partial order reductions, and the handling of data is symbolic. On a family of benchmarks, the proposed approach is consistently faster than Bounded Model Checking. In addition, this report presents a compact encoding of the restrained subset of difference logic in propositional logic

On verifying ATL transformations using 'off-the-shelf' SMT solvers

International audienceMDE is a software development process where models constitute pivotal elements of the software to be built. If models are well-specified, transformations can be employed for various purposes, e.g., to produce final code. However, transformations are only meaningful when they are 'correct': they must produce valid models from valid input models. A valid model has conformance to its meta-model and fulfils its constraints, usually written in OCL. In this paper, we propose a novel methodology to perform automatic, unbounded verification of ATL transformations. Its main component is a novel first-order semantics for ATL transformations, based on the interpretation of the corresponding rules and their execution semantics as first-order predicates. Although, our semantics is not complete, it does cover a significant subset of the ATL language. Using this semantics, transformation correctness can be automatically verified with respect to non-trivial OCL pre- and postconditions by using SMT solvers, e.g. Z3 and Yices

Microtiming patterns and interactions with musical properties in Samba music

In this study, we focus on the interaction between microtiming patterns and several musical properties: intensity, meter and spectral characteristics. The data-set of 106 musical audio excerpts is processed by means of an auditory model and then divided into several spectral regions and metric levels. The resulting segments are described in terms of their musical properties, over which patterns of peak positions and their intensities are sought. A clustering algorithm is used to systematize the process of pattern detection. The results confirm previously reported anticipations of the third and fourth semiquavers in a beat. We also argue that these patterns of microtiming deviations interact with different profiles of intensities that change according to the metrical structure and spectral characteristics. In particular, we suggest two new findings: (i) a small delay of microtiming positions at the lower end of the spectrum on the first semiquaver of each beat and (ii) systematic forms of accelerando and ritardando at a microtiming level covering two-beat and four-beat phrases. The results demonstrate the importance of multidimensional interactions with timing aspects of music. However, more research is needed in order to find proper representations for rhythm and microtiming aspects in such contexts

Adapting Real Quantifier Elimination Methods for Conflict Set Computation

International audienceThe satisfiability problem in real closed fields is decidable. In the context of satisfiability modulo theories, the problem restricted to conjunctive sets of literals, that is, sets of polynomial constraints, is of particular importance. One of the central problems is the computation of good explanations of the unsatisfiability of such sets, i.e. obtaining a small subset of the input constraints whose conjunction is already unsatisfiable. We adapt two commonly used real quantifier elimination methods, cylindrical algebraic decomposition and virtual substitution, to provide such conflict sets and demonstrate the performance of our method in practice